Algebra and Sequent Calculus for Epistemic Actions
نویسندگان
چکیده
We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of non-determinism, (iii) it naturally extends beyond boolean sets of propositions, up to intuitionistic and non-distributive situations, hence allowing to accommodate constructive computational, information-theoretic as well as non-classical physical settings, and (iv) introduces a structure on the actions, which now constitute a quantale. We also introduce a corresponding sequent calculus (which extends Lambek calculus), in which propositions, actions as well as agents appear as resources in a resource-sensitive dynamic-epistemic logic.
منابع مشابه
Reasoning about Dynamic Epistemic Logic
We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multi-agent systems. We contribute to it by equipping it with a logical account of resources, a semi-automatic way of reasoning through the algebra and sequent calculus, and finally by generalizing it to non-boolean settings. Dynamic Epistemic Logic (DEL) is a PDL-style logic [1...
متن کاملA Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes
The pi-calculus process algebra describes the interaction of concurrent and communicating processes. In this paper we present the syntax and semantics of a dynamic epistemic logic for multi-agent systems, where the epistemic actions are finite processes in the pi-calculus. We then extend the language to include actions from a specified set of action structures. We define a proof system for the ...
متن کاملEpistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. due to secrecy and deceit, as well as nested knowledge. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the c...
متن کاملar X iv : m at h / 06 08 16 6 v 1 [ m at h . L O ] 7 A ug 2 00 6 Epistemic actions as resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the children are allowed to lie and cheat. Epistemic ...
متن کاملAxiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus
This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 126 شماره
صفحات -
تاریخ انتشار 2005